Strong Approximations for Queues with Customer Choice and Constant Delays

نویسندگان

  • Jamol Pender
  • Richard H. Rand
  • Elizabeth Wesson
چکیده

Many service systems provide queue length information to customers thereby allowing customers to choose among many options of service. However, queue length information is often delayed and is often not provided in real time. Recent work by Dong et al. [7] explores the impact of these delays in an empirical study in U.S. hospitals. Work by Pender et al. [27] uses a two-dimensional fluid model to study the impact of delayed information and determine the exact threshold under which delayed information can cause oscillations in the dynamics of the queue length. In this work, we confirm that the fluid model analyzed by Pender et al. [27] can be rigorously obtained as a functional law of large numbers limit of a stochastic queueing process and we generalize their threshold analysis to arbitrary dimensions. Moreover, we prove a functional central limit theorem for the queue length process and show that the scaled

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues

This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the ke...

متن کامل

The Impact of Delay Announcements in Many-Server Queues with Abandonment

This paper studies the performance impact of making delay announcements to arriving customers who must wait before starting service in a many-server queue with customer abandonment. The queue is assumed to be invisible to waiting customers, as in most customer contact centers, when contact is made by telephone, email or instant messaging. Customers who must wait are told upon arrival either the...

متن کامل

Power series approximations for two-class generalized processor sharing systems

We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are non-empty, a customer of queue 1 is served with probability β and a customer of queue 2 is served with probability 1 − β. If one of the queues is empty, a customer of the other queue is served with probability 1. We first describe the generating functionU(z1,...

متن کامل

Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals

An algorithm is developed to determine time-dependent staffing levels to stabilize the time-dependent abandonment probabilities and expected delays at positive target values in the Mt/GI/st + GI many-server queueing model, which has a nonhomogeneous Poisson arrival process (the Mt), general service times (the first GI) and allows customer abandonment according to a general patience distribution...

متن کامل

The Error in Steady-State Approximations for the Time-Dependent Waiting Time Distribution

Arrival processes to queues often exhibit time dependence, but time-dependent queues are notoriously difficult to analyze. Usually one adopts some kind of steadystate approximation for time-dependent performance. We consider a range of queueing models that see wide use in practice, particularly in the modeling of service industry applications, and develop approximations for the error involved i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017